Linear, Branching Time and Joint Closure Semantics for Temporal Logic

نویسندگان

  • Joeri Engelfriet
  • Jan Treur
چکیده

Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often used for this purpose: linear and branching time models. In this paper a third approach, based on socalled joint closure models, is studied using models which incorporate all possible behaviour in one model. Relations between this approach and the other two are studied. In order to define constructions needed to relate branching time models, appropriate algebraic notions are defined (in a category theoretical manner) and exploited. In particular, the notion of joint closure is used to construct one model subsuming a set of models. Using this universal algebraic construction we show that a set of linear models can be merged to a unique branching time model. Logical properties of the described algebraic constructions are studied. The proposed approach has been successfully aplied to obtain an appropriate semantics for nonmonotonic reasoning processes based on default logic. References are discussed that show the details of these applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief

In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. The latter operator is interpreted with respect to a version of the bundle semantics. In addition the temporal logic of knowledge (belief) contains an indexed set of ...

متن کامل

From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability

This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combi...

متن کامل

A Clausal Resolution Method for Extended Computation Tree Logic ECTL

A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in computer science and AI requiring branching time logic...

متن کامل

Temporal Logic for Scenario-Based Specifications

We provide semantics for the powerful scenario-based language of live sequence charts (LSCs). We show how the semantics of live sequence charts can be captured using temporal logic. This is done by studying various subsets of the LSC language and providing an explicit translation into temporal logic. We show how a kernel subset of the LSC language (which omits variables, for example) can be emb...

متن کامل

An Asynchronous Automata Approach to the Semantics of Temporal Logic

The paper presents the differential equations that characterize an asynchronous automaton and gives their solution n x } 1 , 0 { : → R . Remarks are made on the connection between the continuous time and the discrete time of the approach. The continuos and discrete time, linear and branching temporal logics have the semantics depending on x and their formulas give the properties of the automaton.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Logic, Language and Information

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2002